On the Approximability of the Maximum Common Subgraph Problem
نویسنده
چکیده
Some versions of the maximum common subgraph problem are studied and approximation algorithms are given. The maximum bounded common induced subgraph problem is shown to be Max SNP-hard and the maximum unbounded common induced subgraph problem is shown to be as hard to approximate as the maximum independent set problem. The maximum common induced connected subgraph problem is still harder to approximate and is shown to be NPO PB-complete, i.e. complete in the class of optimization problems with optimal value bounded by a polynomial.
منابع مشابه
Approximability Distance in the Space of H-Colourability Problems
A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. We study the approximability properties of the Weighted MaximumH-Colourable Subgraph problem (MAX H -COL). The instances of this problem are edge-weighted graphs G and the objective is to find a subgraph of G that has maximal total edge weight, under the condition that the subgraph has a hom...
متن کاملAn Approximability-related Parameter on Graphs - Properties and Applications
We introduce a binary parameter on optimisation problems called separation. The parameter is used to relate the approximation ratios of different optimisation problems; in other words, we can convert approximability (and nonapproximability) result for one problem into (non)-approximability results for other problems. Our main application is the problem (weighted) maximum H-colourable subgraph (...
متن کاملGraph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts
A graph homomorphism is a vertex map which carries edges from a source graph to edgesin a target graph. The instances of the Weighted Maximum H-Colourable Subgraph problem(MAX H -COL) are edge-weighted graphs G and the objective is to find a subgraph of G that hasmaximal total edge weight, under the condition that the subgraph has a homomorphism to H ;note that for H = Kk th...
متن کاملOn the approximability of some degree-constrained subgraph problems
In this article we provide hardness results and approximation algorithms for the following three natural degree-constrained subgraph problems, which take as input an undirected graph G = (V, E). Let d ≥ 2 be a fixed integer. The Maximum d-degree-bounded Connected Subgraph (MDBCSd) problem takes as additional input a weight function ω : E → R, and asks for a subset E′ ⊆ E such that the subgraph ...
متن کاملProperties of an Approximability-related Parameter on Circular Complete Graphs
The instances of theWeighted Maximum H-Colourable Subgraph problem (Max H-Col) are edge-weighted graphs G and the objective is to find a subgraph of G that has maximal total edge weight, under the condition that the subgraph has a homomorphism to H; note that for H = Kk this problem is equivalent to Max k-cut. Färnqvist et al. have introduced a parameter on the space of graphs that allows close...
متن کامل